By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 15, Issue 3, pp. 283-433

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs

Romeo Rizzi

pp. 283-288

BibTeX  Abstract Full Text:  PDF

Infinite Families of 3-Designs from Z4-Goethals Codes with Block Size 8

Kalle Ranto

pp. 289-304

BibTeX  Abstract Full Text:  PDF

Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1

Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, and Hung Q. Ngo

pp. 305-316

BibTeX  Abstract Full Text:  PDF

Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

Yaagoub A. Ashir and Iain A. Stewart

pp. 317-328

BibTeX  Abstract Full Text:  PDF

Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour

Gérard Cornuéjols and Bertrand Guenin

pp. 329-352

BibTeX  Abstract Full Text:  PDF

Dominating Pair Graphs

Jitender S. Deogun and Dieter Kratsch

pp. 353-366

BibTeX  Abstract Full Text:  PDF

Multidimensional Convolutional Codes

Bruce Kitchens

pp. 367-381

BibTeX  Abstract Full Text:  PDF

Interference Patterns in Regular Graphs with Bijective Colorings

Peter C. Fishburn and Paul E. Wright

pp. 382-402

BibTeX  Abstract Full Text:  PDF

Strong T-Perfection of Bad-K4-Free Graphs

Alexander Schrijver

pp. 403-415

BibTeX  Abstract Full Text:  PDF

How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems

David Peleg and Avishai Wool

pp. 416-433

BibTeX  Abstract Full Text:  PDF